Coinductive Intersection Types are Completely Unsound
نویسنده
چکیده
منابع مشابه
The Complete Unsoundness of Coinductive Types and their Semantics
Certain type assignment systems are known to ensure or characterize normalization. The grammar of the types they feature is usually inductive. It is easy to see that, when types are coinductively generated, we obtain unsound type systems (meaning here that they are able to type some mute terms). Even more, for most of those systems, it is not difficult to find an argument proving that every ter...
متن کاملAll the {\lambda}-Terms are Meaningful for the Infinitary Relational Model
Type assignment systems are known to grant or characterize normalization. The grammar of the types they feature is usually inductive. It is easy to see that, when types are coinductively generated, we obtain unsound type systems (meaning here that they are able to type some non head-normalizing terms). Even more, for most of those systems, it is not difficult to find an argument proving that ev...
متن کاملSemantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for -calculi ?
Coinductive (applicative) characterizations of various observational congruences which arise in the semantics of-calculus, for various reduction strategies, are discussed. Two semantic techniques for establishing the coincidence of the applicative and the contextual equivalences are analyzed. The rst is based on intersection types, the second is based on a mixed induction-coinduction principle.
متن کاملSemantic subtyping between coinductive mutable record types with unions and intersections
Semantic subtyping between coinductive record types supports accurate type analysis of object-oriented languages, by introducing Boolean type constructors and modeling cyclic objects. In previous work, a sound and complete algorithm for semantic subtyping has been proposed, but only for coinductive immutable record types with unions. In this work we address the issue of extending the previous r...
متن کاملThe Multiset-Theoretic Collapse of the Sequential Intersection Type System is Surjective
We present a type system (that we refer to as System S) that features sequences as intersection types, in contrast with Gardner/de Carvalho’s System R, that uses multisets to represent intersection. Systems S and R are both linear and forbid contraction/duplication. We explain why any reduction choice in System R (i.e. any way to perform Subject Reduction) may be encoded in System S by resortin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.06740 شماره
صفحات -
تاریخ انتشار 2016